Poster: Neighbor Selection Based on TIV Severity Sort Model in Vivaldi Network Coordinate System
نویسندگان
چکیده
Network Coordinate (NC) system is an efficient and scalable mechanism to estimate the distance between Internet hosts. However, the existence of Triangle Inequality Violation (TIV) decreases the accuracy of NC system. With focus on most widely used NC system, Vivaldi, we propose an effective mechanism of neighbor selection based on TIV Severity Sort to improve Vivaldi performance. By sorting existing hosts based on corresponding edges’ TIV severity, the 90th percentile relative error(NPRE) of Vivaldi is decreased by 13.9%. The convergence rate is improved, and the final median prediction error is 7.9% smaller.
منابع مشابه
A Reputation-Based Approach for Securing Vivaldi Embedding System
Many large-scale Internet applications optimize their overlay network to reduce latencies. Embedding coordinate systems like Vivaldi are valuable tools for this new range of applications since they propose light-weight algorithms that permit to estimate the latency between any pair of nodes without having to contact them first. It has been recently demonstrated that coordinate systems in genera...
متن کاملVeracity: a fully decentralized service for securing network coordinate systems
Decentralized logical coordinate systems have been proposed as a means of estimating network distances. These systems have widespread usage in p2p networks, ranging from neighbor selection to replica placement. Unfortunately, these systems are vulnerable to even a small number of malicious nodes lying about their coordinates or measurements. In this paper, we introduce Veracity, a fully decentr...
متن کاملA Unified Network “Coordinate” System for Bandwidth and Latency
Network coordinate systems, such as GNP and Vivaldi, provide virtual positions for networked hosts, which enable the hosts to connect to nearby peers, find the closest server, or organize themselves in a topologically-aware manner. Current network coordinate systems, however, only use latency to compute the positions, leaving out an important network metric—namely bandwidth. In this paper, we p...
متن کاملTowards a Robust Framework of Network Coordinate Systems
Network Coordinate System (NCS) is an efficient and scalable mechanism to predict latency between any two network hosts based on historical measurements. Most NCS models, such as metric space embedding based, like Vivaldi, and matrix factorization based, like DMF and Phoenix, use squared error measure in training which suffers from the erroneous records, i.e. the records with large noise. To ov...
متن کاملCharm: A charming network coordinate system
We present a new network coordinate system, Charm, embedding round-trip time latencies into a Euclidean space. Charm is based on a particle system model with two spatial force interactions: attraction and repulsion. The update algorithm (Charming) that Charm uses is simple and lightweight: At each latency sample, the algorithm either “attracts” the communicating nodes to each other or “repels” ...
متن کامل